On polynomial solvability of the high multiplicity total weighted tardiness problem
نویسندگان
چکیده
منابع مشابه
A GPI dynasearch neighborhood for the total weighted tardiness problem
art exact algorithms suffer from relatively poor performances. On the other hand the problem has been successfully tackled by local search heuristic algorithms where the neighborhood of a solution is usually computed by applying swap (a.k.a. pairwise interchange) operators to the working sequence. Dynasearch is a neighborhood search technique introduced by Congram et al. [1] whose main feature ...
متن کاملAnt Colony Optimization for the Total Weighted Tardiness Problem
In this article we present an application of the Ant Colony Optimization (ACO) metaheuristic to the single machine total weighted tardiness problem. First, we briefly discuss the constructive phase of ACO in which a colony of artificial ants generates a set of feasible solutions. Then, we introduce some simple but very effective local search. Last, we combine the constructive phase with local s...
متن کاملNew Instances for the Single Machine Total Weighted Tardiness Problem
Previous research in the single machine total weighted tardiness problem (SMTWTP) has led to the proposition of effective local search strategies. At least existing benchmark instances from the literature do not pose a challenge for state-of-the-art algorithms. This paper describes the proposition of two classes of novel instances for the single machine total weighted tardiness problem. In resp...
متن کاملOn the single machine total tardiness problem
In this paper we study the single machine total tardiness problem. We first identify some optimality properties based on which a special case with a given number of distinct due dates is proved polynomially solvable. The results are then extended to the case with release dates. 2004 Published by Elsevier B.V.
متن کاملStudying the Performance of Unified Particle Swarm Optimization on the Single Machine Total Weighted Tardiness Problem
Swarm Intelligence algorithms have proved to be very effective in solving problems on many aspects of Artificial Intelligence. This paper constitutes a first study of the recently proposed Unified Particle Swarm Optimization algorithm on scheduling problems. More specifically, the Single Machine Total Weighted Tardiness problem is considered, and tackled through a scheme that combines Unified P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1993
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90034-l